Retrial Queueing System with Several Input Flows
نویسنده
چکیده
type i, , K , 1 i = who finds the server free begins to get service inmediately and leaves the system after completion. Otherwise, if the server is busy, the customer with probability 1 Hi leaves the system without service and with probability Hi > 0 joins an orbit of repeated customer but conserves its own type. The intervals separating two succesive repeated attempts of each customers from the orbit are exponentially distributed with rate γ. The orbit is finite or infinite. In case of a finite orbit an arriving customer who finds the server busy and the orbit completely full is lost. We derive the steady state probabilities of the multidimensional Markov process underlying the considered queueing system.
منابع مشابه
Averaging Met hods for Transient Regimes in Overloading Retrial Queueing Systems
A new approach is suggested to study transient and stable regimes in overloading retrial queueing systems. This approach is based on limit theorems of averaging principle and diffusion approximation types for so-called switching processes. Two models of retrial queueing systems of the types h?/G/i/w.r (multidimensional Poisson input flow, one server with general service times, retrial system) a...
متن کاملSufficient stability conditions for multi-class constant retrial rate systems
We study multi-class retrial queueing systems with Poisson inputs, general service times, and an arbitrary numbers of servers and waiting places. A class-i blocked customer joins orbit i and waits in the orbit for retrial. Orbit i works like a single-server ·/M/1 queueing system with exponential retrial time regardless of the orbit size. Such retrial systems are referred to as retrial systems w...
متن کاملA Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times
We consider a discrete-time Geo/G/1 retrial queue in which the retrial time has a general distribution and the server, after each service completion, begins a process of search in order to find the following customer to be served. We study the Markov chain underlying the considered queueing system and its ergodicity condition. We find the generating function of the number of customers in the or...
متن کاملA retrial system with two input streams and two orbit queues
Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i = 1, 2) finds the server busy, it is blocked and routed to a separate type-i retrial (orbit) queue that attempts to re-dispatch its jobs at its specific Poisson rate. This creates a system with three dependent queues. Such a queueing s...
متن کاملStandard and Retrial Queueing Systems: a Comparative Analysis
We describe main models and results of a new branch of the queueing theory, theory of retrial queues, which is characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again. Emphasis is done on comparison with standard queues wit...
متن کامل